Simplified Erasure/List Decoding
نویسندگان
چکیده
منابع مشابه
Simplified High-Speed High-Distance List Decoding for Alternant Codes
This paper presents a simplified list-decoding algorithm to correct any number w of errors in any alternant code of any length n with any designed distance t+1 over any finite field Fq. The algorithm is efficient for w close to, and in many cases slightly beyond, the Fq Johnson bound J ′ = n′− √ n′(n′ − t− 1) where n′ = n(q−1)/q, assuming t+1 ≤ n′. In the typical case that qn/t ∈ (lgn) and that...
متن کاملComparison of Simplified Gradient Descent Algorithms for Decoding Ldpc Codes
In this paper it is shown that multi GDBF algorithm exhibits much faster convergence as compared to the single GDBF algorithm. The multi GDBF algorithm require less iterations when compared to the single GDBF algorithm for the search point to closely approach the local maximum point taking into consideration the gradient descent bit flipping (GDBF) algorithms exhibiting better decoding performa...
متن کاملComdined Turbo Block Decoding and Equalisation
In this paper, the combination of equalization and turbo decoding is studied. In the iterative decoding of a product code in block turbo coding system, the equalization process is performed within the iteration loop. The present study aims to investigate the decision feedback equalizer (DFE) incorporated in the iterative decoding. Simulation results show that the more severe the channel interfe...
متن کاملSimplified sum-product algorithm for decoding LDPC codes with optimal performance
A simple, yet effective decoding algorithm is proposed for low-density parity-check (LDPC) codes, which significantly simplifies the check node update computation of the optimal sum-product algorithm. It achieves essentially optimal performance by applying scaling in the decoder’s extrinsic information. If no such scaling is applied, then the proposed algorithm has small performance degradation...
متن کاملPerformance of Space-Time Bit-Interleaved Codes in Fading Channels with Simplified Iterative Decoding
The performance of space-time bit-interleaved codes over block fading channels is considered. Decoding is based on iterative demapping and decoding. The demapper delivers soft information to the decoder, and accepts feedback from the decoder. Schemes with both soft and hard feedback are described. In particular, we consider the deployment of bit interleaved block/convolutional codes with memory...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2017
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2017.2689778